Monotone Optimal Control of Permutable GSMPs

نویسندگان

  • Paul Glasserman
  • David D. Yao
چکیده

We consider Markovian GSMPs (generalized semi-Markov processes) in which the rates of events are subject to control. A control is monotone if the rate of one event is increasing or decreasing in the number of occurrences of other events. We give general conditions for the existence of monotone optimal controls. The conditions are functional properties for the one-step cost functions and, more importantly, structural properties for the GSMP. The main conditions on costs are submodularity or supermodularity with respect to pairs of events. The key structural condition is strong permutability, requiring that the state at any time be determined by the number of events of each type that have occurred, regardless of their order. This permits a reformulation of the original control problem into one based only on event counting processes. This reformulation leads to a unified treatment of a broad class of models and to meaningful generality beyond existing results.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Locally monotone Boolean and pseudo-Boolean functions

We propose local versions of monotonicity for Boolean and pseudoBoolean functions: say that a pseudo-Boolean (Boolean) function is p-locally monotone if none of its partial derivatives changes in sign on tuples which differ in less than p positions. As it turns out, this parameterized notion provides a hierarchy of monotonicities for pseudo-Boolean (Boolean) functions. Local monotonicities are ...

متن کامل

Constructions for optimal constant weight cyclically permutable codes and difference families

A cyclically permutable code is a binary code whose codewords are cyclically distinct and have full cyclic order. An important class of these codes are the constant weight cyclically permutable codes. In a code of this class all codewords have the same weight w. These codes have many applications, including in optical code-division multiple-access communication systems and in constructing proto...

متن کامل

Optimal (v, 3, 1) binary cyclically permutable constant weight codes with small v

We classify up to multiplier equivalence optimal (v, 3, 1) binary cyclically permutable constant weight (CPCW) codes with v ≤ 61. There is a one-to-one correspondence between optimal (v, 3, 1) CPCW codes, optimal cyclic binary constant weight codes with weight 3 and minimal distance 4, (v, 3; b(v − 1)/6c) difference packings, and optimal (v, 3, 1) optical orthogonal codes. Therefore the classif...

متن کامل

Necessary Optimality Conditions for Control of Strongly Monotone Variational Inequalities

In this paper we derive necessary optimality conditions involving Mordukhovich coderivatives for optimal control problems of strongly monotone variational inequalities.

متن کامل

Optimal Bilinear Control of an Abstract Schrödinger Equation

Well-posedness of abstract quantum mechanical systems is considered and the existence of optimal control of such systems is proved. First order optimality systems are derived. Convergence of the monotone scheme for the solution of the optimality system is proved.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Oper. Res.

دوره 19  شماره 

صفحات  -

تاریخ انتشار 1994